RFID (Radio Frequency Identification) is a new technology which is used in many applications. Security and privacy are two concerns of RFID technology. To address these concerns, many protocols have been proposed, which each of them has advantages and disadvantages. In this paper after introducing three lightweight matrixes based RFID authentication protocols, the feasibility of some attacks such as de-synchronization attack, reader impersonation attack and tag traceability attack against these protocols have been investigated. In addition, we also have tried to address disadvantages of theses protocols by proposing an improved authentication protocol.In an improved protocol we exploit two lightweight pseudorandom number generators (AKARI-1 and AKARI-2) with maximum 128 bit and 64 bit. Hence, proposed protocol is still conforming to EPC Class-1 Gen-2 standard and can provide its requirements.

The ability to easily and quickly access information through radio frequency identification (RFID) systems has led to the ever-expanding use of this technology in a variety of usages such as tactical applications. This technology provides the conditions for better situational awareness in tactical environments or logistics. But, on the other hand, the process of identification in a scenario with different and numerous actors, faces the collision challenge. The collision of tags in RFID systems is inevitable, and it affects the performance of RFID systems, especially in environments with a large number of tags. In this report, a hybrid (of ALOHA and tree-based) anti-collision protocol is proposed. In the provided protocol, each frame and slot have prefixes, and in each slot, tags whose identities match the prefixes of the frame and the slot, send their responses to the reader. In this protocol, using the Manchester Coding method, the position of the collision bits is specified, and then collision tags are split into separate subgroups to reduce the collision rate in the identification process. The simulation results of this protocol indicate that compared to other benchmark protocols, the identification time and the bit number of transferred tags in the proposed method are lower, which improve its performance.

In recent years, the Internet of Things (IoT) networks have extensively been used in various practical field, one of the most important of which is medical Internet of Things (MIoT). In these networks, radio frequency identification (RFID) is one of the main technologies in creating an authentication system that is able to efficiently identify and identify medical equipment and patients. Therefore, researchers in this field have proposed different authentication protocols for RFID-based MIOT systems and claimed that they are resistant to active and passive attacks. Contrary to their claims, most of these protocols are not resistant to conventional attacks. Fan et al. have recently proposed a lightweight RFID authentication scheme for cloud-based RFID health-care systems and claimed that it is sufficiently efficient and secure. In this paper, we analyzed the Fan et al protocole and demonstrated that their protocol is vulnerable to replay, reader impersonation, tag tracking, and de-synchronization attacks. Moreover, we show how the similarity of some of their protocol messages causes attack. Then, we propose an improved protocol (LRAMP) that is resistant to these and other known attacks in RFID authentication protocol. According to security analysis, we can see that the LRAPM protocol has a high level of security. This high security can only be achieved by adding a new message and changing other messages. A comparison of the performance of the LRAPM protocol shows that this protocol is comparable to similar protocols in terms of computational costs, storage costs and communication costs.

System identification using radio waves (RFID) wireless identification system that is capable of communicating by means of data exchange between a tag object to a commodity, cards, etc. Connected and a code reader. RFID system of electronic and electromagnetic signals to read and write data without making contact. Basically any system that is able to read and discern information about the people or goods identification system is said to be. Automatic identification and general data retention is a way in which hardware or software to be able to read the data without detection and get help from a person are. One of the newest topics of interest to scientists to identify individuals or goods identification system using radio frequency. In general this technology in many different and important organizations being used and well your exam. This article introduces the Radio ID technology (RFID) and compares it with barcode-based identification systems.

Nowadays Radio Frequency Identification (RFID) systems have appeared in lots of identification and authentication applications. In some sensitive applications, providing secure and confidential communication is very important for end-users. To this aim, different RFID authentication protocols have been proposed, which have tried to provide security and privacy of RFID users. In this paper, we analyze the privacy of two recently proposed RFID authentication protocols in 2012 and 2013. We present several traceability attacks including traceability, backward traceability and forward traceability against the first protocol. We also show that, the second protocol not only suffers from Denial-of-Service (DoS) attack, but also it is vulnerable to traceability and backward traceability attacks. We present our privacy analysis based on a well-known formal RFID privacy model which has been proposed by Ouafi and Phan in 2008. Then, in order to overcome the weaknesses, we apply some modifications on these protocols and propose two modified versions.

Background and Objective: Given the continuous emphasis by governmental, judicial, law enforcement, and security institutions on combating the crime of goods smuggling, which leads to reduced production and employment, this research focuses on the integration of technologies and aims to explore how to combat goods smuggling through the integration of GIS and RFID systems. Method: This research is applied in terms of purpose and descriptive-analytical in terms of method and nature, with a survey approach. The study population included 105 heads and deputies of the Economic Security Police and Customs Police of the Law Enforcement Force of the Islamic Republic of Iran (Faraja) and provincial units. The sample size was determined to be 82 using Cochran's formula and simple random sampling. Data collection was conducted using a researcher-made questionnaire, and data analysis was performed using a one-sample t-test with SPSS 23 software. Findings: Based on the research findings, combating goods smuggling is feasible in three areas: the GIS system, the RFID system, and the intersection of these two systems. According to statistical data, the intersection of the two systems, the capabilities of GIS, and the capabilities of RFID have the most significant impact on combating goods smuggling, respectively. Conclusion: The results of the study indicate that GIS and RFID systems, as well as their intersections, are effective in combating goods smuggling. Designing an integrated monitoring and control system using RFID and enhancing the informational layers of the GIS system by the Customs Police can lead to an effective fight against this crime.

RFID system is a wireless technology that can transfer data between tags and readers via radio frequency. In an RFID network, readers are located close to each other to obtain optimal connectivity and sufficient coverage. In such an environment, which is called dense reader environment (DRE).Different types of collisions such as Reader-to-Reader and Reader-to-Tag ones, often lead to serious problems such as decreasing the performance. Accordingly, providing an appropriate method to resolve reader collision appeared to be one of the most important research topics in the field. To solve this problem, different methods have been introduced of which NFRA protocol has higher throughput. In this paper, we use multi-channel technique and sift distribution function on the NFRA protocol to improve RFID system throughput while avoiding increase in reader collision. In addition of supporting mobile reader, the proposed method provides higher throughput compared to other protocols in dense environments.

Authentication protocols are tools used to ensure the identity of the parties in cyberspace. If these protocols are compromised، the cyber security is threatened. These threats are of paramount importance in military applications. Recently، in [1] an authentication protocol، called SPRS has been considered and several attacks such as secret disclosure attack، tag impersonation attack and tag traceability attack have been applied on it. In addition، authors of that paper، presented the improved version of the protocol and claimed the improved protocol، unlike its predecessor، is secure against the attacks applied on the predecessor version and also other active and passive attacks. In this paper، we show that unfortunately، the security claims of authors do not hold and the improved protocol is also vulnerable against secret disclosure attack and tag traceability attack. We offer two versions of the secret disclosure attack which are offline and online versions. The basis of the attacks presented in this paper is that given Y=PRNG(X) and PRNG function is a public function and X and Y are 16 bits، performing an exhaustive search to find X as a pre-image of Y with a maximum of 216 off-line evaluations of PRNG function is possible. The offline version of the attack with the complexity of one run of protocol eavesdropping and doing 233 evaluations of PRNG function can disclose 4 secret values of protocol i. e. Ki، Pi، NT and EPCS which are 16 bits and the online version of the attack with the complexity of two times impersonating the reader and doing 217 evaluations of PRNG function can disclose these 4 secret values of protocol. Given these secret disclosure attacks، the improved protocol is not secure against other active and passive attacks as well. In addition، we propose a tag traceability attack to trace a given tag which does not depend on the length of the output of the PRNG function. Given this attack، an adversary can trace a given tag between any two sessions with the reader.